Was Sierpinski Right? IV
نویسنده
چکیده
We prove for any μ = μ < θ < λ, λ large enough (just strongly inaccessible Mahlo) the consistency of 2 = λ → [θ]23 and even 2 μ = λ → [θ]2σ,2 for σ < μ. The new point is that possibly θ > μ. Typed 5/92 (20 , k 2 -Mahlo,λ → [א2]23; some on models) I thank Alice Leonhardt for the beautiful typing. Latest Revision 2012/Oct/24 Revised and Expanded 5/94 based on lectures, Summer ’94, Jerusalem. Partially supported by the basic research fund, Israeli Academy of Sciences. Typeset by AMS-TEX 1
منابع مشابه
Spectral triples and the geometry of fractals
We construct spectral triples for the Sierpinski gasket as infinite sums of unbounded Fredholm modules associated with the holes in the gasket and investigate their properties. For each element in the K-homology group we find a representative induced by one of our spectral triples. Not all of these triples, however, will have the right geometric properties. If we want the metric induced by the ...
متن کاملON Q-BITOPOLOGICAL SPACES
We study here $T_{0}$-$Q$-bitopological spaces and sober $Q$-bitopological spaces and their relationship with two particular Sierpinski objects in the category of $Q$-bitopological spaces. The epireflective hulls of both these Sierpinski objects in the category of $Q$-bitopological spaces turn out to be the category of $T_0$-$Q$-bitopological spaces. We show that only one of these Sierpinski ob...
متن کاملGeneralized Sierpinski Fractal Multiband Antenna
A new set of fractal multiband antennas called mod Sierpinski gaskets is presented.Mod Sierpinski fractal antennas derive from the Pascal triangle and present a log-periodic behavior, which is a consequence of their self-similarity properties.Mod Sierpinski fractal antennas constitute a generalization of the classical Sierpinski antenna.
متن کاملAcyclic Edge-coloring of Sierpinski-like Graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by χ′a(G). Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined ...
متن کاملProposing an Innovative Model Based on the Sierpinski Triangle for Forecasting EUR/USD Direction Changes
The Sierpinski triangle is a fractal that is commonly used due to some of its characteristics and features. The Forex financial market is among the places wherein this trianglechr('39')s characteristics are effective in forecasting the prices and their direction changes for the selection of the proper trading strategy and risk reduction. This study presents a novel approach to the Sierpinski tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 65 شماره
صفحات -
تاریخ انتشار 2000